Local Asymptotics and the Minimum Description Length
نویسندگان
چکیده
Common approximations for the minimum description length (MDL) criterion imply that the cost of adding a parameter to a model fit to n observations is about (1/2) log n bits. While effective for parameters which are large on a standardized scale, this approximation overstates the parameter cost near zero. A uniform approximation and local asymptotic argument show that the addition of a small parameter which is about two standard errors away from zero produces a model whose description length is shorter than that of the comparable model which sets this parameter to zero. This result implies that the decision rule for adding a model parameter is comparable to a traditional statistical hypothesis test. Encoding the parameter produces a shorter description length when the corresponding estimator is about two standard errors away from zero, unlike a model selection criterion like BIC whose threshold increases logarithmically in n.
منابع مشابه
Chapter 7 Asymptotics and Coding Theory : One of the n ! • Dimensions of Terry
Terry joined the Berkeley Statistics faculty in the summer of 1987 after being the statistics head of CSIRO in Australia. His office was just down the hallway from mine on the third floor of Evans. I was beginning my third year at Berkeley then and I remember talking to him in the hallway after a talk that he gave on information theory and the Minimum Description Length (MDL) Principle of Rissa...
متن کاملAdd Cartesian Differential Invariants to Minimum Description Length Shape Models
The minimum description length approach can automatic solve the point correspondence problem and give the better statistical shape models than those built by hand or equally spaced way. The current mdl approaches build the models only based on the segmented shapes without considering the local image structure and may place the markers at wrong places. This paper adds Cartesian differential inva...
متن کاملLearning Bayesian Belief Networks Based on the MDL Principle: An Efficient Algorithm Using the Branch and Bound Technique∗
In this paper, the computational issue in the problem of learning Bayesian belief networks (BBNs) based on the minimum description length (MDL) principle is addressed. Based on an asymptotic formula of description length, we apply the branch and bound technique to finding true network structures. The resulting algorithm searches considerably saves the computation yet successfully searches the n...
متن کاملKaryotypic Study and Chromosome Evolution in Some Iranian Local Onion Populations
Abstract A karyotypic study was performed on 12 Iranian local onion (Allium cepa L.) populations. A number of mitotic cells at metaphase stage for each population were prepared. Chromosomes of suitable mitotic cells were counted and various parameters, including long arm (L), short arm (S), total length of chromosome (TL), relative length of chromosome (RL), arm ratio (AR), r-value, total chro...
متن کاملAsymptotics for the infinite time ruin probability of a dependent risk model with a constant interest rate and dominatedly varying-tailed claim sizes
This paper mainly considers a nonstandard risk model with a constant interest rate, where both the claim sizes and the inter-arrival times follow some certain dependence structures. When the claim sizes are dominatedly varying-tailed, asymptotics for the infinite time ruin probability of the above dependent risk model have been given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998